ASAP : Towards Accurate, Stable and Accelerative Penetrating-Rank Estimation on Large Graphs
نویسندگان
چکیده
منابع مشابه
On the Efficiency of Estimating Penetrating Rank on Large Graphs
P-Rank (Penetrating Rank) has been suggested as a useful measure of structural similarity that takes account of both incoming and outgoing edges in ubiquitous networks. Existing work often utilizes memoization to compute PRank similarity in an iterative fashion, which requires cubic time in the worst case. Besides, previous methods mainly focus on the deterministic computation of P-Rank, but la...
متن کاملIs Acceleration Used for Ocular Pursuit and Spatial Estimation during Prediction Motion?
Here we examined ocular pursuit and spatial estimation in a linear prediction motion task that emphasized extrapolation of occluded accelerative object motion. Results from the ocular response up to occlusion showed that there was evidence in the eye position, velocity and acceleration data that participants were attempting to pursue the moving object in accord with the veridical motion propert...
متن کاملAlmost all webs are not rank-perfect
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]. Providing a decent linear description of the stable set polytopes of claw-free graphs is a long-standing problem [9]. Ben Rebea conjectured a description for quasi-line graphs, see [12]; Chudnovsky and Seymour [2] v...
متن کاملEvaluation of Cell Penetrating Peptide Delivery System on HPV16E7 Expression in Three Types of Cell Line
Background: The poor permeability of the plasma and nuclear membranes to DNA plasmids are two major barriers for the development of these therapeutic molecules. Therefore, success in gene therapy approaches depends on the development of efficient and safe non-viral delivery systems. Objectives: The aim of this study was to investigate the in vitro delivery of plasmid DNA encoding HPV16 E7 gene...
متن کاملFast and Accurate Low Rank Approximation of Massive Graphs
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and then approximating each cluster separately using existing methods, e.g. the singular value decomposition, or stochastic algorithms. The cluster-wise approximations are then extended to approximate the entire graph. Th...
متن کامل